Search results for "Hybrid systems"
showing 10 items of 24 documents
Time-varying Sampled-data Observer with Asynchronous Measurements
2019
International audience; In this paper a time-varying observer for a linear continuous-time plant with asynchronous sampled measurements is proposed. The observer is contextualized in the hybrid systems framework providing an elegant setting for the proposed solution. In particular some theoretical tools are provided, in terms of LMIs, certifying asymptotic stability of a certain compact set where the estimation error is zero. We consider sampled asynchronous measurements that occur at arbitrary times in a certain window with an upper and lower bound. The design procedure, that we propose for the selection of the time-varying gain, is based on a constructive algorithm that is guaranteed to f…
State Observer with Round-Robin Aperiodic Sampled Measurements with Jitter
2021
International audience; A sampled-data observer is proposed for linear continuous-time systems whose outputs are sequentially sampled via non-uniform sampling intervals repeating a prescribed Round-Robin sequence. With constant sampling intervals (jitter-free case) we provide constructive necessary and sufficient conditions for the design of an asymptotic continuous-discrete observer whose estimation error is input-to-state stable (ISS) from process disturbances and measurement noise. We use a time-varying gain depending on the elapsed time since the last measurement. With non-constant sampling intervals (jitter-tolerant case), our design conditions are only sufficient. A suspension system …
Optimal paths in weighted timed automata
2004
AbstractWe consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n(|δ(A)|+|wmax|)), where n is the number of clock…
A New HLA-Based Distributed Control Architecture for Agricultural Teams of Robots in Hybrid Applications with Real and Simulated Devices or Environme…
2011
The control architecture is one of the most important part of agricultural robotics and other robotic systems. Furthermore its importance increases when the system involves a group of heterogeneous robots that should cooperate to achieve a global goal. A new control architecture is introduced in this paper for groups of robots in charge of doing maintenance tasks in agricultural environments. Some important features such as scalability, code reuse, hardware abstraction and data distribution have been considered in the design of the new architecture. Furthermore, coordination and cooperation among the different elements in the system is allowed in the proposed control system. By integrating …
Dynamics of gene regulatory networks and their dependence on network topology and quantitative parameters – the case of phage λ
2019
Background Gene regulatory networks can be modelled in various ways depending on the level of detail required and biological questions addressed. One of the earliest formalisms used for modeling is a Boolean network, although these models cannot describe most temporal aspects of a biological system. Differential equation models have also been used to model gene regulatory networks, but these frameworks tend to be too detailed for large models and many quantitative parameters might not be deducible in practice. Hybrid models bridge the gap between these two model classes – these are useful when concentration changes are important while the information about precise concentrations and binding…
HLPV Identication in wireless ad hoc networks
2013
Hybrid systems are dynamical systems consisting of components with con- tinuous and discrete behavior and thus they have required a new hybrid systems and control theory that has been developed in the past years and is still an active research topic. Motivated by a practical example, the tra c ow in wireless ad hoc network model, we derive Hybrid LPV modeling and identi cation techniques. Finally we show simulation results of o line identi cation and possible future algorithms.
Localization from inertial data and sporadic position measurements
2020
A novel estimation strategy for inertial navigation in indoor/outdoor environments is proposed with a specific attention to the sporadic nature of the non-periodic measurements. After introducing the inertial navigation model, we introduce an observer providing an asymptotic estimate of the plant state. We use a hybrid dynamical systems representation for our results, in order to provide an effective, and elegant theoretical framework. The estimation error dynamics with the proposed observer shows a peculiar cascaded interconnection of three subsystems (allowing for intuitive gain tuning), with perturbations occurring either on the jump or on the flow dynamics (depending on the specific sub…
Quantized Dissensus in switching networks with nodes death and duplication
2009
Dissensus, death and division
2009
The modeling of switching systems describing networks where death and duplication processes occur is described. A dissensus protocol, complementary to consensus protocol, is introduced and the convergence or divergence of the agents' state evolution is studied. We discuss some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.
Boolean-controlled systems via receding horizon and linear programing
2009
We consider dynamic systems controlled by boolean signals or decisions. We show that in a number of cases, the receding horizon formulation of the control problem can be solved via linear programing by relaxing the binary constraints on the control. The idea behind our approach is conceptually easy: a feasible control can be forced by imposing that the boolean signal is set to one at least one time over the horizon. We translate this idea into constraints on the controls and analyze the polyhedron of all feasible controls. We specialize the approach to the stabilizability of switched and impulsively controlled systems.